A New Logical Machine

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new branch of the logical algebra: UP-algebras

In this paper, we introduce a new algebraic structure, called a UP-algebra (UP means the University of Phayao) and a concept of UP-ideals, UP-subalgebras, congruences and UP-homomorphisms in UP-algebras, and investigated some related properties of them. We also describe connections between UP-ideals, UP-subalgebras, congruences and UP-homomorphisms, and show that the notion of UP-algebras is a ...

متن کامل

Machine Cell Formation Based on a New Similarity Coefficient

One of the designs of cellular manufacturing systems (CMS) requires that a machine population be partitioned into machine cells. Numerous methods are available for clustering machines into machine cells. One method involves using a similarity coefficient. Similarity coefficients between machines are not absolute, and they still need more attention from researchers. Although there are a number o...

متن کامل

Logical Task Modelling for Man-Machine Dialogue

To design a task-independent dialogue system, we present a task-oriented dialogue analysis in terms of finding the referents of definite descriptions and we show how this analysis leads to a goal-oriented inferential representation of the task. This representation provides a logical generic model of the task, which is compatible with a belief system. Then, we show how this task model, jointly u...

متن کامل

Logical approaches to Machine Learning --- an overview

The ability to learn from observations and experience seems to be crucial for any intelligent being. Likewise, Machine Learning plays a central role in Artificial Intelligence research. Learning is no different from many other cognitive phenomena in that it resists a general definition. A first try could be: learning is the ability to improve on a certain task. For instance, the task may be fac...

متن کامل

Logical N-AND Gate on a Molecular Turing Machine

In Boolean algebra, it is known that the logical function that corresponds to the negation of the conjunction –NAND– is universal in the sense that any other logical function can be built based on it. This property makes it essential to modern digital electronics and computer processor design. Here, we design a molecular Turing machine that computes the NAND function over binary strings of arbi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1889

ISSN: 0028-0836,1476-4687

DOI: 10.1038/041079c0